<!DOCTYPE html>
<html>
<head>
	<title>创建二叉树</title>
</head>
<body>

<script type="text/javascript" src="./js/TreeNode1.js"></script>
<script type="text/javascript">
const targetArr = [8,3,10,1,6,14,4,7,13];//要遍历的数组
const bst1 = new BST(targetArr);
console.log(bst1);
console.log(bst1.levelOrder());
console.log(bst1.isCompleteTree());
const bst2 = new BST(targetArr);
console.log(bst2);
</script>
</body>
</html>